Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
نویسندگان
چکیده
منابع مشابه
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the problem to find a maximum-size submatrix of a 0/1-matrix such that the submatrix has the C1P. Moreover, we achieve a proble...
متن کاملApproximability of Bounded Occurrence Max Ones
We study the approximability of MAX ONES when the number of variable occurrences is bounded by a constant. For conservative constraint languages (i.e., when the unary relations are included) we give a complete classification when the number of occurrences is three or more and a partial classification when the bound is two. For the non-conservative case we prove that it is either trivial or equi...
متن کاملMAX ONES Generalized to Larger Domains
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subject to a set of constraints. When the domain is Boolean (i.e. restricted to {0, 1}), the maximum solution problem is identical to the well-studied Max Ones problem, and the approximability is completely understood for a...
متن کاملConverting Approximate Error Bounds into Exact Ones
In order to produce error bounds quickly and easily, people often apply to error bounds linearized propagation rules. This is done instead of a precise error analysis. The payoff: Estimates so produced are not guaranteed to be true bounds. One can at most hope that they are good approximations of true bounds. This paper discusses a way to convert such approximate error bounds into true bounds. ...
متن کاملOn the Parameterized Complexity of Exact Satisfiability Problems
For many problems, the investigation of their parameterized complexity provides an interesting and useful point of view. The most obvious natural parameterization for the maximum satisfiability problem—the number of satisfiable clauses—makes little sense, because at least half of the clauses can be satisfied in any formula. We look at two optimization variants of the exact satisfiability proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2016
ISSN: 1942-3454,1942-3462
DOI: 10.1145/2858787